Extracting Feasible Programs
نویسنده
چکیده
This work in progress paper presents a methodology for reasoning about the computational complexity of functional programs, which are extracted from proofs. We suggest a first order arithmetic AT which is a syntactic restriction of Peano arithmetic. We establish that the set of functions which is provably total in AT, is exactly the set of polynomial time functions. This result has been accepted at Conference of the European Association for Computer Science Logic (CSL), 2001. Compared to others feasible arithmetics, AT is surprisingly simpler. The main feature of AT concerns the treatment of the quantification. The range of quantifiers is restricted to the set of actual terms which is the set of constructor terms with variables. The second feature concerns a restriction of the inductive formulas. Although this paper addresses some theoretical aspects of program extractions, it is relevant for practical issue, in the long term, because certifying the computational resource consumed by a program is a challenging issue.
منابع مشابه
Inverse feasible problem
In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
متن کاملAutomated Proof and Program Development
The aim of this paper is to present proof and program development in in-tuitionistic logic and attempt to automating this with tactics and strategies. It is important in computer science to have correct programs and much work has been devoted to this aspect. Typically, the study of the relationships between intuitionistic logic and computer science leads to the programming with proofs, i.e., ex...
متن کاملASSOCIATED (SEMI)HYPERGROUPS FROM DUPLEXES
In this paper using strongly duplexes we introduce a new class of (semi)hypergroups. The associated (semi)hypergroup from a strongly duplex is called duplex (semi)hypergroup. Two computer programs written in MATLAB show that the two groups $Z_{2n}$ and $Z_{n}times Z_{2}$ produce a strongly duplex and its associated hypergroup is a complementary feasible hypergroup.
متن کاملA Heuristic Approach for Solving LIP with the Optional Feasible or Infeasible Initial Solution Points
An interactive heuristic approach can offer a practical solution to the problem of linear integer programming (LIP) by combining an optimization technique with the Decision Maker’s (DM) judgment and technical supervision. This is made possible using the concept of bicriterion linear programming (BLP) problem in an integer environment. This model proposes two bicriterion linear programs for iden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002